Перевод: с английского на все языки

со всех языков на английский

logarithmic approximation

См. также в других словарях:

  • Logarithmic integral function — In mathematics, the logarithmic integral function or integral logarithm li(x) is a special function. It occurs in problems of physics and has number theoretic significance, occurring in the prime number theorem as an estimate of the number of… …   Wikipedia

  • Stirling's approximation — In mathematics, Stirling s approximation (or Stirling s formula) is an approximation for large factorials. It is named in honour of James Stirling.The formula is written as:n! approx sqrt{2pi n}, left(frac{n}{e} ight)^{n}.Roughly, this means that …   Wikipedia

  • Domatic number — A domatic partition. In graph theory, a domatic partition of a graph G = (V,E) is a partition of V into disjoint sets V1, V2,...,VK such that each Vi is a dominati …   Wikipedia

  • Dominating set — For Dominator in control flow graphs, see Dominator (graph theory). Dominating sets (red vertices). In graph theory, a dominating set for a graph G = (V, E) is a subset D of V such that every vertex not in D is joined to at… …   Wikipedia

  • Art gallery problem — The art gallery problem or museum problem is a well studied visibility problem in computational geometry. It originates from a real world problem of guarding an art gallery with the minimum number of guards which together can observe the whole… …   Wikipedia

  • Nuclear weapon yield — Logarithmic scatterplot comparing the yield (in kilotons) and weight (in kilograms) of all nuclear weapons developed by the United States. The explosive yield of a nuclear weapon is the amount of energy discharged when a nuclear weapon is… …   Wikipedia

  • Logarithm — The graph of the logarithm to base 2 crosses the x axis (horizontal axis) at 1 and passes through the points with coordinates (2, 1), (4, 2), and (8, 3) …   Wikipedia

  • Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… …   Wikipedia

  • Prime number theorem — PNT redirects here. For other uses, see PNT (disambiguation). In number theory, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers. The prime number theorem gives a general description of how the primes are… …   Wikipedia

  • Super-logarithm — In mathematics, the super logarithm is one of the two inverse functions of tetration. Just as exponentiation has two inverse functions: roots and logarithms, likewise tetration has two inverse functions: super roots and super logarithms. There… …   Wikipedia

  • Exponential integral — is a mathematical function of a single argument which has no established notation.DefinitionsFor real values of x , the exponential integral Ei( x ) can be defined as : mbox{Ei}(x)=int { infty}^xfrac{e^t}t,dt., The definition above can be used… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»